A new infinite family of minimally nonideal matrices

نویسنده

  • Jonathan Wang
چکیده

Minimally nonideal matrices are a key to understanding when the set covering problem can be solved using linear programming. The complete classification of minimally nonideal matrices is an open problem. One of the most important results on these matrices comes from a theorem of Lehman, which gives a property of the core of a minimally nonideal matrix. Cornuéjols and Novick gave a conjecture on the possible cores of minimally nonideal matrices. This paper disproves their conjecture by constructing a new infinite family of square minimally nonideal matrices. In particular, we show that there exists a minimally nonideal matrix with r ones in each row and column for any r ≥ 3.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A catalog of minimally nonideal matrices

This paper describes a backtracking algorithm for the enumeration of nonisomorphic minimally nonideal (n × n) matrices that are not degenerate projective planes. The application of this algorithm for n ≤ 12 yielded 20 such matrices, adding 5 matrices to the 15 previously known. For greater dimensions, n = 14 and n = 17, 13 new matrices are given. For nonsquare matrices, 38 new minimally nonidea...

متن کامل

An application of Fibonacci numbers into infinite Toeplitz matrices

The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p

متن کامل

From imperfection to nonidealness

Beyond perfection, the field to be explored is too wide. In this context, several ways to classify imperfect graphs or, equivalently, 0, 1 (clique-node) imperfect matrices can be found in the literature. From the polyhedral point of view, ideal matrices are to set covering problems what perfect matrices are to set packing problems. In fact, if a matrix is ideal, its linear relaxation is an inte...

متن کامل

Lehman matrices

A pair of square 0, 1 matrices A, B such that AB = E + kI (where E is the n × n matrix of all 1s and k is a positive integer) are called Lehman matrices. These matrices figure prominently in Lehman’s seminal theorem on minimally nonideal matrices. There are two choices of k for which this matrix equation is known to have infinite families of solutions. When n = k +k +1 and A = B, we get point-l...

متن کامل

On a certain class of nonideal clutters

In this paper we define the class of near-ideal clutters following a similar concept due to Shepherd [Near perfect matrices, Math. Programming 64 (1994) 295–323] for near-perfect graphs. We prove that near-ideal clutters give a polyhedral characterization for minimally nonideal clutters as near-perfect graphs did for minimally imperfect graphs. We characterize near-ideal blockers of graphs as b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 118  شماره 

صفحات  -

تاریخ انتشار 2011